“Order-online-and-pickup-offline” strategy for online direct sale of time-sensitive commodities
نویسندگان
چکیده
Although recent decades have witnessed rapid development of e-commerce, direct sale time-sensitive commodities on e-commerce platforms still faces significant challenges due to the dilemma between short delivery time and high costs. To alleviate these challenges, manufacturers with online retailing operations attempted cooperate offline retailers by using an “order-online, pickup-offline” (OOPO) strategy. study problem effectively implementing OOPO strategy for commodities, we consider a mechanism under which manufacturer pays cooperative service fee ensure coordination channels. We develop Stackelberg game-theoretic models compare profits both channels before after implementation By analyzing models, derive feasible range such that are more profitable implementation. further examine plausibility when required charge same price can lead channel pricing coordination.
منابع مشابه
Online Appendix: Ideological Segregation Online and Offline
In table 2 we present standard errors for our main estimates. For estimates that come from MRI, the GSS or the CNES, we compute standard errors through a nonparametric bootstrap over samples of respondents. For estimates that come from comScore aggregate data, that is not an option. Instead we perform a parametric bootstrap in which we model the share conservative of each website as an independ...
متن کاملOnline and Offline Selling in Limit Order Markets
Completely automated electronic securities exchanges and algorithms for trading in these exchanges have become very important for modern finance. In [4], Kakade et al. introduced the limit order market model, which is a prevalent paradigm in electronic markets. In this paper, we consider both online and offline algorithms for maximizing revenue when selling in limit order markets. We first prov...
متن کاملOffline to Online Conversion
We consider the problem of converting offline estimators into an online predictor or estimator with small extra regret. Formally this is the problem of merging a collection of probability measures over strings of length 1,2,3,... into a single probability measure over infinite sequences. We describe various approaches and their pros and cons on various examples. As a side-result we give an elem...
متن کاملGarment Recommendations for Online and Offline Consumers
Recommender Systems have obvious influence in environments where data size exceeds the capabilities of any user to fully explore the available choices in the store (physical or on-line). Many algorithms and techniques have been used to help recommending useful and interesting items to users. If the user is unidentified, the process is even harder as there are no historical or other data to use ...
متن کاملOffline and Online Facility Leasing
We study the problem of leasing facilities over time, following the general infrastructure leasing problem framework introduced by Anthony and Gupta [1]. If there are K different lease types, Anthony and Gupta give an O(K)-approximation algorithm for the problem. We are able to improve this to a 3-approximation algorithm by using a variant of the primal-dual facility location algorithm of Jain ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Rairo-operations Research
سال: 2021
ISSN: ['1290-3868', '0399-0559']
DOI: https://doi.org/10.1051/ro/2020019